Time-Multiplexed Multiple-Constant Multiplication

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Shortening of processing time of optimal design of multiple constant multiplication using FPGAs

Problem of designing multiple constant multiplication (MCM) circuits with minimum cost is known to be an NP-complete problem. Several techniques using combinatorial optimization algorithms such as genetic algorithms (GAs), etc., have been proposed. However, if implemented as software, as the circuit scale increases, a great deal of time is needed for optimization. The purpose of this study is t...

متن کامل

Multiplication by an Integer Constant

We present and compare various algorithms, including a new one, allowing to perform multiplications by integer constants using elementary operations. Such algorithms are useful, as they occur in several problems, such as the Toom-Cook-like algorithms to multiply large multiple-precision integers, the approximate computation of consecutive values of a polynomial, and the generation of integer mu...

متن کامل

Dynamically Reconfigurable Constant Multiplication on FPGAs

Multiplication with constants is one of the most important operations in digital signal processing including digital filters and linear transformations like the fast Fourier transform. Runtime reconfiguration of the multiplied coefficients, also called reconfigurable single constant multiplication (RSCM), is an efficient method to reduce resources by time-multiplexing and resource sharing. Ther...

متن کامل

Efficient Bit-Serial Constant Multiplication for FPGAs

This paper describes how to realize place-effective synchronous bit-serial constant multiplications, which can be efficiently used for a block of constants (Multiple Constant Multiplication). The architecture combines traditional concepts and new approaches, which leads to the possibility of simultanous fast multiplications of different input values. Fast multiplications are a core for up-to-da...

متن کامل

High-speed All- Optical Time Division Multiplexed Node

In future high-speed self-routing photonic networks based on all-optical time division multiplexing (OTDM) it is highly desirable to carry out packet switching, clock recovery and demultplexing in the optical domain in order to avoid the bottleneck due to the optoelectronics conversion. In this paper we propose a self-routing OTDM node structure composed of an all-optical router and demultiplex...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

سال: 2007

ISSN: 0278-0070

DOI: 10.1109/tcad.2007.893549